Rough Sets and Flow Graphs
نویسنده
چکیده
This paper concerns the relationship between rough sets and flow graphs. It is shown that flow graph can be used both as formal language for computing approximations of sets in the sense of rough set theory, and as description tool for data structure. This description is employed next for finding patterns in data. To this end decision algorithm induced by the flow graph is defined and studied.
منابع مشابه
In Pursuit of Patterns in Data Reasoning from Data - The Rough Set Way
This paper concerns some aspects of rough set based data analysis. In particular rough set look on Bayes’ formula leads to new methodology of reasoning from data and shows interesting relationship between Bayes’ theorem, rough sets and flow graphs. Three methods of flow graphs application in drawing conclusions from data are presented and examined. MOTTO: “It is a capital mistake to theorise be...
متن کاملRough Sets, Bayes’ Theorem and Flow Graphs
Rough set theory is a new approach to vagueness and uncertainty. The theory of rough sets has an overlap with many other theories. Specially interesting is the relationship to fuzzy set theory and the theory of evidence. Recently, it turned out that the theory has very interesting connections with Bayes’ theorem. The look on Bayes’ theorem offered by rough set theory reveals that any data set (...
متن کاملAn Efficient Algorithm for Inference in Rough Set Flow Graphs
Pawlak recently introduced rough set flow graphs (RSFGs) as a graphical framework for reasoning from data. No study, however, has yet investigated the complexity of the accompanying inference algorithm, nor the complexity of inference in RSFGs. In this paper, we show that the traditional RSFG inference algorithm has exponential time complexity. We then propose a new RSFG inference algorithm tha...
متن کاملOn $L$-double fuzzy rough sets
ur aim of this paper is to introduce the concept of $L$-double fuzzy rough sets in whichboth constructive and axiomatic approaches are used. In constructive approach, a pairof $L$-double fuzzy lower (resp. upper) approximation operators is defined and the basic properties of them are studied.From the viewpoint of the axiomatic approach, a set of axioms is constructed to characterize the $L...
متن کاملEquivalent Characterizations of Some Graph Problems by Covering-Based Rough Sets
Covering is a widely used form of data structures. Covering-based rough set theory provides a systematic approach to this data. In this paper, graphs are connected with covering-based rough sets. Specifically, we convert some important concepts in graph theory including vertex covers, independent sets, edge covers, and matchings to ones in covering-based rough sets. At the same time, correspond...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005